A generalized attack on RSA type cryptosystems
نویسندگان
چکیده
منابع مشابه
A generalized attack on RSA type cryptosystems
Let N = pq be an RSA modulus with unknown factorization. Some variants of the RSA cryptosystem, such as LUC, RSA with Gaussian primes and RSA type schemes based on singular elliptic curves use a public key e and a private key d satisfying an equation of the form ed − k ( p − 1 ) ( q − 1 ) = 1. In this paper, we consider the general equation ex− ( p − 1 ) ( q − 1 ) y = z and present a new attack...
متن کاملA Generalized Wiener Attack on RSA
We present an extension of Wiener’s attack on small RSA secret decryption exponents [10]. Wiener showed that every RSA public key tuple (N, e) with e ∈ ∗ φ(N) that satisfies ed − 1 = 0 mod φ(N) for some d < 1 3 N 1 4 yields the factorization of N = pq. Our new method finds p and q in polynomial time for every (N, e) satisfying ex + y = 0 mod φ(N) with x < 1 3 N 1 4 and |y| = O(N− 3 4 ex). In ot...
متن کاملA new and optimal chosen-message attack on RSA-type cryptosystems
Chosen-message attack on RSA is usually considered as an inherent property of its homomorphic structure. In this paper, we show that nonhomomorphic RSA-type cryptosystems are also susceptible to a chosen-message attack. In particular, we prove that only one message is needed to mount a successful chosen-message attack against the Lucas-based systems and Demytko’s elliptic curve system.
متن کاملAttack on RSA-Type Cryptosystems Based on Singular Cubic Curves over Z/nZ
Several RSA-type cryptosystems based on singular cubic curves have been proposed in recent years (cf. Koyama, Lecture notes in Computer Science, vol. 921, Springer, Berlin, 1995, pp. 329–339; Kuwakado, IEICE Trans. Fund. E78-A (1995) 27–33; Koyama, IEICE Trans. Fund. E77-A (1994) 1309–1318). We show that these schemes are equivalent and demonstrate that they are insecure if a linear relation is...
متن کاملCryptanalysis of RSA-type cryptosystems: A visit
This paper surveys RSA-type implementations based on Lucas sequences and on elliptic curves. The main focus is the way how some known attacks on RSA were extended to LUC, KMOV and Demytko’s system. It also gives some directions for the choice of the most appropriate RSA-type system for a given application.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.09.009